A combinatorial problem about binary necklaces and attractors of Boolean automata networks
نویسنده
چکیده
It is known that there are no more Lyndon words of length n than there are periodic necklaces of same length. This paper considers a similar problem where, additionally, the necklaces must be without some forbidden factors. This problem relates to a different context, concerned with the behaviours of particular discrete dynamical systems, namely, Boolean automata networks. A formal argument supporting the following idea is provided: addition of cycle intersections in network structures causes exponential reduction of the networks’ number of attractors.
منابع مشابه
Combinatorics of Boolean automata circuits dynamics
In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dyn...
متن کاملOn the number of attractors of Boolean automata circuits
In line with elds of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the a...
متن کاملBlock-sequential update schedules and Boolean automata circuits
Our work is set in the framework of complex dynamical systems and, more precisely, that of Boolean automata networks modeling regulation networks. We study how the choice of an update schedule impacts on the dynamics of such a network. To do this, we explain how studying the dynamics of any network updated with an arbitrary blocksequential update schedule can be reduced to the study of the dyna...
متن کاملCounting and classifying attractors in high dimensional dynamical systems.
Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors ...
متن کاملOn the existence of symmetric chain decompositions in a quotient of the Boolean lattice
We highlight a question about binary necklaces, i.e., equivalence classes of binary strings under rotation. Is there a way to choose representatives of the n-bit necklaces so that the subposet of the Boolean lattice induced by those representatives has a symmetric chain decomposition? Alternatively, is the quotient of the Boolean lattice Bn, under the action of the cyclic group Zn, a symmetric ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1605.01505 شماره
صفحات -
تاریخ انتشار 2016